1945E - Binary Search - CodeForces Solution

binary search constructive algorithms

Please click on ads to support us..

Python Code: 

for i in range(int(input())):
  n,x=map(int,input().split())
  A=list(map(int,input().split()))
  ind=A.index(x)
  r,l=n,0
  while r-l!=1:
    mid=(r+l)//2
    if A[mid]<=x:
      l=mid
    else:
      r=mid
  print(1)
  print(ind+1,l+1)


Comments

Submit
0 Comments
More Questions

409H - A + B Strikes Back
1262A - Math Problem
158C - Cd and pwd commands
194A - Exams
1673B - A Perfectly Balanced String
1104B - Game with string
1169B - Pairs
1567D - Expression Evaluation Error
78A - Haiku
1287A - Angry Students
1428A - Box is Pull
234B - Reading
581B - Luxurious Houses
1481C - Fence Painting
935A - Fafa and his Company
22A - Second Order Statistics
1720B - Interesting Sum
1720A - Burenka Plays with Fractions
3A - Shortest path of the king
1720C - Corners
574A - Bear and Elections
352B - Jeff and Periods
1244A - Pens and Pencils
1670A - Prof Slim
1189A - Keanu Reeves
678A - Johny Likes Numbers
1699C - The Third Problem
1697D - Guess The String
754B - Ilya and tic-tac-toe game
760A - Petr and a calendar